A distributed arc-consistency algorithm

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Distributed Arc-Consistency Algorithm

Consistency techniques are an e cient way of tackling constraint satisfaction problems (CSP). In particular, various arc-consistency algorithms have been designed such as the time optimal AC-4 sequential algorithm of Mohr and Henderson [8]. In this paper, we present a new distributed arc-consistency algorithm, called DisAC-4. DisAC-4 is based on AC-4, and is a coarse-grained parallel algorithm ...

متن کامل

A New Algorithm for Singleton Arc Consistency

Constraint satisfaction technology emerged from AI research. Its practical success is based on integration of sophisticated search with consistency techniques reducing the search space by removing as many as possible inconsistent values from the problem. Singleton consistency is a meta-consistency technique that reinforces other pure consistency techniques by their repeated invocation and thus ...

متن کامل

An optimal coarse-grained arc consistency algorithm

The use of constraint propagation is the main feature of any constraint solver. It is thus of prime importance to manage the propagation in an efficient and effective fashion. There are two classes of propagation algorithms for general constraints: fine-grained algorithms where the removal of a value for a variable will be propagated to the corresponding values for other variables, and coarse-g...

متن کامل

Arc-Consistency and Arc-Consistency Again

There is no need to show the importance of arc-consistency in Constraint Networks. Mohr and Henderson [8] have proposed AC-4, an algorithm having an optimal worst-case time complexity. But it has two drawbacks: its space complexity and its average time complexity. In problems with many solutions, where the size of the constraints is large, these drawbacks become so important that users often re...

متن کامل

AC-*: A Configurable, Generic and Adaptive Arc Consistency Algorithm

In this paper, we present CAC, a new configurable, generic and adaptive algorithm for establishing arc consistency for binary constraints. CAC is configurable, that is by combining some parameters CAC corresponds to any existing AC algorithm: AC-3, AC-4, AC-6, AC-7, AC-2000, AC-2001, AC-8, AC-3d, AC-3.2 and AC-3.3. CAC is generic, like AC-5, because it may takes into account the structure of th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Science of Computer Programming

سال: 1998

ISSN: 0167-6423

DOI: 10.1016/s0167-6423(97)00012-9